Iterated Claws Have Real-rooted Genus Polynomials
نویسندگان
چکیده
We prove that the genus polynomials of the graphs called iterated claws are real-rooted. This continues our work directed toward the 25-year-old conjecture that the genus distribution of every graph is log-concave. We have previously established log-concavity for sequences of graphs constructed by iterative vertexamalgamation or iterative edge-amalgamation of graphs that satisfy a commonly observable condition on their partitioned genus distributions, even though it had been proved previously that iterative amalgamation does not always preserve realrootedness of the genus polynomial of the iterated graph. In this paper, the iterated topological operation is adding a claw, rather than vertexor edge-amalgamation. Our analysis here illustrates some advantages of employing a matrix representation of the transposition of a set of productions. Version: 10:23 April 6, 2015
منابع مشابه
Combinatorics of Polynomial Iterations
A complete description of the iterated monodromy groups of postcritically finite backward polynomial iterations is given in terms of their actions on rooted trees and automata generating them. We describe an iterative algorithm for finding kneading automata associated with post-critically finite topological polynomials and discuss some open questions about iterated monodromy groups of polynomials.
متن کاملGenus Distributions for Iterated Claws
We derive a recursion for the genus distributions of the graphs obtained by iteratively attaching a claw to the dipole D3. The minimum genus of the graphs in this sequence grows arbitrarily large. The families of graphs whose genus distributions have been calculated previously are either planar or almost planar, or they can be obtained by iterative single-vertex or single-edge amalgamation of s...
متن کاملGenus distribution of graph amalgamations: Pasting when one root has arbitrary degree
This paper concerns counting the imbeddings of a graph in a surface. In the first installment of our current work, we showed how to calculate the genus distribution of an iterated amalgamation of copies of a graph whose genus distribution is already known and is further analyzed into a partitioned genus distribution (which is defined for a double-rooted graph). Our methods were restricted there...
متن کاملOn a New Type of Multiplier Sequences and Discriminant Amoebae
In the classical paper [PS14] I. Schur and G. Polýa introduced and characterized two types of multiplier sequences, i.e. linear operators acting diagonally in the monomial basis of R[x] and sending real-rooted (resp. with all real roots of the same sign) polynomials to real-rooted polynomials. Motivated by a fundamental property of amoebae and discriminants discovered in [GKZ94] we introduce be...
متن کاملNew Multiplier Sequences via Discriminant Amoebae
In their classic 1914 paper, Polýa and Schur introduced and characterized two types of linear operators acting diagonally on the monomial basis of R[x], sending real-rooted polynomials (resp. polynomials with all nonzero roots of the same sign) to real-rooted polynomials. Motivated by fundamental properties of amoebae and discriminants discovered by Gelfand, Kapranov, and Zelevinsky, we introdu...
متن کامل